Anonymizing Graphs
Uploaded by: Sergey Kirgizov
Upload date: 2020-12-11 21:17:37
Edited at: 2021-03-26 11:30:00
Edited by: Sergey Kirgizov

Comments:

Anonymize graph by adding edges. No lossy compression considered here. $(k, \ell)$-anonymity is defined in this paper. See also * http://theory.stanford.edu/~tomas/ and * http://theory.stanford.edu/~sunabar/Publications.html
Sergey Kirgizov at 2020-12-11 21:19:12
Edited by Sergey Kirgizov at 2021-03-26 11:18:22

Please consider to register or login to comment on the paper.